package codingStudy.Dynamic.Fibonacci;

/**
 * @author dell
 * @category fibonacci初始版本
 */
public class Bate0 {
	static int fio(int x) {
		if (x == 0)
			return 0;
		if (x == 1)
			return 1;

		return fio(x - 1) + fio(x - 2);
	}

	public static void main(String[] args) {
		long start = System.currentTimeMillis();
		int result = fio(10);
		long end = System.currentTimeMillis();
		long time = end - start;
		System.out.println(result + " " + time + "");
	}
}
